Limited-Time Lookahead Diagnosability of Rectangular Hybrid Automata
نویسندگان
چکیده
منابع مشابه
Limited-Time Lookahead Diagnosability of Rectangular Hybrid Automata
This paper investigates the diagnosability of Rectangular Hybrid Automata used for modeling a class of hybrid systems. First, a generalized definition of Limited-Time Lookahead diagnosability of timed languages, for multiple failure modes, is proposed. Then, we provide a systematic approach, for checking the LTLa diagnosability of systems modeled with Rectangular Hybrid Automata, and verifying ...
متن کاملDiagnosability Verification for Hybrid Automata
We define a notion of diagnosability for hybrid automata, which generalizes the notion of observability. We propose a procedure to check diagnosability on a given hybrid automaton, and show that the complexity of the verification problem is in PTIME. We apply our procedure to an electromagnetic valve system for camless engines. This paper, because of space limitations, only summarizes the obtai...
متن کاملDiscrete-Time Control for Rectangular Hybrid Automata
Rectangular hybrid automatamodel digital control programs of analog plant environments. We study rectangular hybrid automata where the plant state evolves continuously in real-numbered time, and the controller samples the plant state and changes the control state discretely, only at the integer points in time. We prove that rectangular hybrid automata have nite bisimilarity quotients when all c...
متن کاملLazy Rectangular Hybrid Automata
We introduce the class of lazy rectangular hybrid automata. The key feature of this class is that both the observation of the continuous state and the rate changes associated with mode switchings take place with bounded delays. We show that the discrete time dynamics of this class of automata can be effectively analyzed without requiring resetting of the continuous variables during mode changes.
متن کاملState Equivalences for Rectangular Hybrid Automata
Three natural equivalence relations on the in nite state space of a hybrid automaton are language equivalence, simulation equivalence, and bisimulation equivalence. When one of these equivalence relations has a nite quotient, certain model checking and controller synthesis problems are decidable. When bounds on the number of equivalence classes are obtained, bounds on the running times of model...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2009
ISSN: 1474-6670
DOI: 10.3182/20090916-3-es-3003.00049